منابع مشابه
Homonym Population Protocols, or Providing a Small Space of Computation Using a Few Identifiers
Population protocols have been introduced by Angluin et al. as a model in which n passively mobile anonymous finite-state agents stably compute a predicate on the multiset of their inputs via interactions by pairs. The model has been extended by Guerraoui and Ruppert to yield the community protocol models where agents have unique identifiers but may only store a finite number of the identifiers...
متن کاملModel Checking Population Protocols
Population protocols are a model for parameterized systems in which a set of identical, anonymous, finite-state processes interact pairwise through rendezvous synchronization. In each step, the pair of interacting processes is chosen by a random scheduler. Angluin et al. (PODC 2004) studied population protocols as a distributed computation model. They characterized the computational power in th...
متن کاملClocked Population Protocols
Population protocols are required to converge to the correct answer, and are subject to a fairness condition that guarantees eventual progress, but generally have no internal mechanism for detecting when this progress has occurred. We define an extension to the standard population protocol that provides each agent with a clock signal that indicates when the agent has waited long enough. To simp...
متن کاملPlaying With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous agents, modeled by finite automata, interact in pairs according to some rules. Predicates on the initial configurations that can be computed by such protocols have been characterized under several hypotheses. We discu...
متن کاملPopulation Protocols Made Easy
We put forward a simple high-level framework for describing a population protocol, which includes the capacity for sequential execution of instructions and a (limited) capacity for loops and branching instructions. The process of translation of the protocol into its standard form, i.e., into a collection of asynchronously executed state-transition rules, is performed by exploiting nested synchr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2018
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-017-9833-2